-
1 complete minimization
Большой англо-русский и русско-английский словарь > complete minimization
-
2 complete minimization
Математика: полная минимизация -
3 complete minimization
мат.English-Russian scientific dictionary > complete minimization
-
4 minimization
-
5 полная минимизация
Большой англо-русский и русско-английский словарь > полная минимизация
-
6 game
1) игра || играть•game in an extensive form — игра в развёрнутой форме, позиционная игра
game in a reduced form — игра в приведённой форме, приведённая игра
- almost unanimity game - coin matching game - coin tossing game - completely reduced game - constraint gamegame without constraints — игра без ограничений, свободная игра
- end game- fixed sample-size game - game of harmstrung squad car - game of heads or tails - game of odd man out - game of pure chance - game of pursuit and evasion - identification of friend and foe game - inherently unstable game - locally bounded game - locally finite game - machine played game - nonstrictly determined game - one-player game - strictly solvable game - termination game - two-person game - two-player game- war game- weighted majority game - zero-sum two-person game -
7 operation
1) действие2) операция3) оперирование4) процесс, ход5) работа, функционирование6) срабатывание7) управление8) эксплуатация•- hereditarily recursive operationoperation under VFR — авиац. визуальное самолётовождение
См. также в других словарях:
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Minimisation (psychology) — For other uses, see Minimisation. Minification redirects here. For the programming technique, see Minification (programming). Minimisation is a type of deception[1] involving denial coupled with rationalisation in situations where complete denial … Wikipedia
Circumscription (logic) — Not to be confused with circumscribe. Circumscription is a non monotonic logic created by John McCarthy to formalize the common sense assumption that things are as expected unless otherwise specified. Circumscription was later used by McCarthy in … Wikipedia
Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia
Hilbert space — For the Hilbert space filling curve, see Hilbert curve. Hilbert spaces can be used to study the harmonics of vibrating strings. The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It… … Wikipedia
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
Global optimization — is a branch of applied mathematics and numerical analysis that deals with the optimization of a function or a set of functions to some criteria. General The most common form is the minimization of one real valued function f in the parameter space … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
